Set-Sharing Is Not Always Redundant for Pair-Sharing
نویسندگان
چکیده
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) share. That is, either as set-sharing or as pair-sharing. It has been recently argued that (a) set-sharing is interesting not as an observable property in itself, but as an encoding for accurate pair-sharing, and that (b) such an encoding is in fact redundant and can be significantly simplified without loss of pairsharing accuracy. We show that this is not the case when set-sharing is combined with other kinds of information, such as the popular freeness.
منابع مشابه
Set-Sharing is Redundant for Pair-Sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By defining an equivalence relation over the set-sharing domain we ob...
متن کاملCoordination of Information Sharing and Cooperative Advertising in a Decentralized Supply Chain with Competing Retailers Considering Free Riding Behavior
This paper studies a decentralized supply chain in which a manufacturer sells a common generic product through two traditional and online retailers under free riding market. We assume that the traditional retailer provides the value added services but the online retailer does not. Factors such as retail prices, local advertising of the retailers, global advertising of the manufacturer and servi...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملDecomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systematically finding minimal decompositions of abstract domains. Filé and Ranzato advanced the state of the art by introducing a simple method for computing a complement. As an application, they considered the extraction by complementation of the pair-sharing domain PS from the Jacobs and Langen’s set-sharing do...
متن کاملStudying the impact of quantity discount contract and cost-sharing contract on a two-echelon green supply chain profit
The members of a chain always try to find new ways in order to raise their profit. Hence we intend to study two different scenarios in a single item two-echelon green supply chain including two manufacturers and one retailer to study the effects of two effective contracts on members’ profit. Two scenarios are discussed and in first one, first manufacturer proposes quantity discount contract to ...
متن کامل